Determining the $2$-Sylow subgroup of an elliptic curve over a finite field
نویسندگان
چکیده
منابع مشابه
Determining the 2-Sylow subgroup of an elliptic curve over a finite field
In this paper we describe an algorithm that outputs the order and the structure, including generators, of the 2-Sylow subgroup of an elliptic curve over a finite field. To do this, we do not assume any knowledge of the group order. The results that lead to the design of this algorithm are of inductive type. Then a right choice of points allows us to reach the end within a linear number of succe...
متن کاملOn the Exponent of the Group of Points of an Elliptic Curve over a Finite Field
We present a lower bound for the exponent of the group of rational points of an elliptic curve over a finite field. Earlier results considered finite fields Fqm where either q is fixed or m = 1 and q is prime. Here, we let both q and m vary; our estimate is explicit and does not depend on the elliptic curve.
متن کاملStudy of Finite Field over Elliptic Curve: Arithmetic Means
Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. Number theory and algebraic geometry, namely the theory of elliptic curves defined over finite fields, has found applications in cryptology. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible s...
متن کاملOn the Exponents of the Group of Points of an Elliptic Curve over a Finite Field
We present a lower bound for the exponent of the group of rational points of an elliptic curve over a finite field. Earlier results considered finite fields Fqm where either q is fixed or m = 1 and q is prime. Here we let both q and m vary and our estimate is explicit and does not depend on the elliptic curve.
متن کاملComputing the endomorphism ring of an ordinary elliptic curve over a finite field
We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field Fq . Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first algorithm in terms of log q , while our bound for the second algorithm depends primarily on log |DE |, where DE is the discriminant of the order isomorphic to En...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2004
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-04-01640-0